Category: Graph algorithms
- Binary jumping on a tree
- Bipartite matching
- Blossom algorithm
- Breadth-first search
- Centroid decomposition
- Chinese postman problem
- Closure problem
- DFA equivalence
- DFA minimization
- Depth-first search tree
- Eulerian cycle
- Heavy-light decomposition
- Image segmentation
- Lovász toggle
- Maximum density subgraph
- Maximum flow
- Minimum Steiner tree
- Minimum cost maximum flow
- Minimum cut
- Minimum spanning tree
- Mo's algorithm on trees
- Stable marriage problem
- Sweep line